Optimal Relay Node Placement and Trajectory Computation in Sensor Networks with Mobile Data Collector
نویسندگان
چکیده
Most sensornetworkarchitectures typically assume thatnodes are stationary after deployment. However, a number of recent papers have shown that theuseofmobilenodesormobiledata collectors (MDC)can significantly improve the performance of a network. In thismodel, the network can be viewed as a three-tier architecture, where the lowest-tier consists of a set of sensor nodes. Themiddle-tier contains a number of higher powered relay nodes, each acting as a cluster head for a number of sensor nodes in the tier below, and one or more mobile data collector(s), constitute the uppertier. For such hierarchical architectures, there are a number of important design problems such as determining the number of relay nodes that are neededand their locations, determining theappropriatebuffer capacities in the relay nodes to ensure there is no data loss due to buffer overflowand calculating a suitable trajectory for eachMDC. In this paper, we first propose an integrated integer linear program (ILP) formulation that calculates the optimal number and positions of the relay nodes in the middle-tier, along with the requisite buffer sizes.We then present an algorithm for calculating the trajectory of the MDC, based on the relay node locations and the load on each individual relay node, in a way that minimizes the maximum energy dissipation of the relay nodes. Experimental results demonstrate that our approach is feasible for networks with hundreds of sensor nodes.
منابع مشابه
Relay Node Placement and Trajectory Computation of Mobile Data Collectors in Wireless Sensor Networks
متن کامل
An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملEnergy Efficient Routing with Mobile Collector in Wireless Sensor Networks (WSNs)
Energy consumption is a primary concern in the Wireless Sensor Network. This leads to pursue the maximum energy saving at sensor nodes, where a relay is used to transfer the data packet. This leads to the increase in the data gathering latency due to low moving velocity of the mobile collector. In this paper we study the tradeoff between energy saving and data gathering latency in mobile data g...
متن کاملAn Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...
متن کامل